Links in edge-colored graphs
نویسندگان
چکیده
A graph is k-linked (k-edge-linked), k ≥ 1, if for each k pairs of vertices x1, y1, · · · , xk, yk, there exist k pairwise vertex-disjoint (respectively edge-disjoint) paths, one per pair xi and yi, i = 1, 2, · · · , k. Here we deal with the properly-edge-colored version of the k-linked (kedge-linked) problem in edge-colored graphs. In particular, we give conditions on colored degrees and/or number of edges, sufficient for an edge-colored multigraph to be k-linked (k-edge-linked). Some of the obtained results are the best possible. Related conjectures are proposed.
منابع مشابه
On Edge-Colored Graphs Covered by Properly Colored Cycles
We characterize edge-colored graphs in which every edge belongs to some properly colored cycle. We obtain our result by applying a characterization of 1-extendable graphs.
متن کاملMaximum colored trees in edge-colored graphs
Abstract We consider maximum properly edge-colored trees in edge-colored graphs Gc. We also consider the problem where, given a vertex r, determine whether the graph has a spanning tree rooted at r, such that all root-to-leaf paths are properly colored. We consider these problems from graphtheoretic as well as algorithmic viewpoints. We prove their optimization versions to be NP-hard in general...
متن کاملMonochromatic s-t Paths in Edge-Colored Graphs
In this paper we consider an approach to solve the problem of finding monochromatic s-t paths in edge-colored graphs. This approach is based on constructing logical models for the problem. Algorithmic problems extensively investigated in bioinformatics (see e.g. [1] – [3]). In particular, there are a number of applications of different problems of finding paths. In this paper we consider the pr...
متن کاملHomomorphisms of 2-edge-colored graphs
In this paper, we study homomorphisms of 2-edge-colored graphs, that is graphs with edges colored with two colors. We consider various graph classes (outerplanar graphs, partial 2-trees, partial 3-trees, planar graphs) and the problem is to find, for each class, the smallest number of vertices of a 2-edge-colored graph H such that each graph of the considered class admits a homomorphism to H.
متن کاملAcyclicity in edge-colored graphs
A walk W in edge-colored graph is called properly colored (PC) if every pair of consecutive edges in W is of different color. We study five types of PC acyclicity in edge-colored graphs such that graphs of PC acyclicity of type i is a proper superset of graphs of acyclicity of type i+1, i = 1, 2, 3, 4. The first three types are equivalent to the absence of PC cycles, PC trails, and PC walks. Wh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Eur. J. Comb.
دوره 31 شماره
صفحات -
تاریخ انتشار 2010